Towards Policy-aware Queries over Linked Data
نویسنده
چکیده
The Linked Data principles for publishing data on the Web enable the distributed evaluation of queries, where data sources are discovered during runtime. Data sources can have associated licenses that restrict allowed usages. Besides restrictions on the access to the data sources, the usage terms can also restrict the usage terms which can be assigned to derived data artefacts, e.g. query results depending on a data source. We propose to formalise such usage restrictions, in order to automate compliance checks, when query results are used or republished for a specific purpose. This work demonstrates a practical application of a suitable policy formalism published at this conference [1].
منابع مشابه
SAFE: Policy Aware SPARQL Query Federation Over RDF Data Cubes
Several query federation engines have been proposed for accessing public Linked Open Data sources. However, in many domains, resources are sensitive and access to these resources is tightly controlled by stakeholders; consequently, privacy is a major concern when federating queries over such datasets. In this paper, we present SAFE, a SPARQL query federation engine that enables decentralised, p...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملTreo: Best-Effort Natural Language Queries over Linked Data
Linked Data promises an unprecedented availability of data on the Web. However, this vision comes together with the associated challenges of querying highly heterogeneous and distributed data. In order to query Linked Data on the Web today, end-users need to be aware of which datasets potentially contain the data and the data model behind these datasets. This query paradigm, deeply attached to ...
متن کاملSAFE: SPARQL Federation over RDF Data Cubes with Access Control
BACKGROUND Several query federation engines have been proposed for accessing public Linked Open Data sources. However, in many domains, resources are sensitive and access to these resources is tightly controlled by stakeholders; consequently, privacy is a major concern when federating queries over such datasets. In the Healthcare and Life Sciences (HCLS) domain real-world datasets contain sensi...
متن کاملRank-aware, Approximate Query Processing on the Semantic Web
The amount of data on the WWW that adheres to Semantic Web standards is rapidly increasing. Search over this huge Web data corpus frequently leads to queries having large result sets. So, in order to discover data elements, which satisfy a given information need, users must rely on ranking techniques to sort results according to their relevance. Unfortunately, processing queries with ranked res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011